An extension of holonomic sequences: C2-finite sequences
نویسندگان
چکیده
Holonomic sequences are widely studied as many objects interesting to mathematicians and computer scientists in this class. In the univariate case, these satisfying linear recurrences with polynomial coefficients also referred D-finite sequences. A subclass C-finite a recurrence constant coefficients. We investigate set of which satisfy equations that call them C2-finite These natural generalization holonomic paper, we show form difference ring provide methods compute ring. Furthermore, an analogous construction for D2-finite sequences, i.e., constructions can be iterated obtain increasing chain rings.
منابع مشابه
On Some Non-Holonomic Sequences
A sequence of complex numbers is holonomic if it satisfies a linear recurrence with polynomial coefficients. A power series is holonomic if it satisfies a linear differential equation with polynomial coefficients, which is equivalent to its coefficient sequence being holonomic. It is well known that all algebraic power series are holonomic. We show that the analogous statement for sequences is ...
متن کاملThe Jacobsthal Sequences in Finite Groups
Abstract In this paper, we study the generalized order- Jacobsthal sequences modulo for and the generalized order-k Jacobsthal-Padovan sequence modulo for . Also, we define the generalized order-k Jacobsthal orbit of a k-generator group for and the generalized order-k Jacobsthal-Padovan orbit a k-generator group for . Furthermore, we obtain the lengths of the periods of the generalized order-3 ...
متن کاملInverse Mellin Transform of Holonomic Sequences
We describe a method to compute the inverse Mellin transform of holonomic sequences, that is based on a method to compute the Mellin transform of holonomic functions. Both methods are implemented in the computer algebra package HarmonicSums.
متن کاملA representation theorem for (q-)holonomic sequences
Chomsky and Schützenberger showed in 1963 that the sequence dL(n), which counts the number of words of a given length n in a regular language L, satisfies a linear recurrence relation with constant coefficients for n, i.e., it is C-finite. It follows that every sequence s(n) which satisfies a linear recurrence relation with constant coefficients can be represented as dL1 (n)− dL2 (n) for two re...
متن کاملLindelöf Representations and (Non-)Holonomic Sequences
Various sequences that possess explicit analytic expressions can be analysed asymptotically through integral representations due to Lindelöf, which belong to an attractive but largely forgotten chapter of complex analysis. One of the outcomes of such analyses concerns the non-existence of linear recurrences with polynomial coefficients annihilating these sequences, and, accordingly, the non-exi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2023
ISSN: ['1095-855X', '0747-7171']
DOI: https://doi.org/10.1016/j.jsc.2022.10.008